L_1 Shortest Path Queries among Polygonal Obstacles in the Plane
نویسندگان
چکیده
Given a point s and a set of h pairwise disjoint polygonal obstacles with a total of n vertices in the plane, after the free space is triangulated, we present an O(n + h log h) time and O(n) space algorithm for building a data structure (called shortest path map) of size O(n) such that for any query point t, the length of the L1 shortest obstacle-avoiding path from s to t can be reported in O(logn) time and the actual path can be found in additional time proportional to the number of edges of the path. Previously, the best algorithm computes such a shortest path map in O(n logn) time and O(n) space. In addition, our techniques also yield an improved algorithm for computing the L1 geodesic Voronoi diagram of m point sites among the obstacles. 1998 ACM Subject Classification F.2 Analysis of algorithms and problem complexity
منابع مشابه
Geodesic Fréchet Distance with Polygonal Obstacles
We present the first algorithm to compute the geodesic Fréchet distance between two polygonal curves in a plane with polygonal obstacles, where distances between points are measured as the length of a shortest path between them. Using shortest path structures that we call dynamic and static spotlights, we efficiently construct and propagate reachability information through the free space diagra...
متن کاملAn Optimal Algorithm for Euclidean Shortest Paths in the Plane
We propose an optimal-time algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Our algorithm runs in worst-case time O(n logn) and requires O(n logn) space, where n is the total number of vertices in the obstacle polygons. The algorithm is based on an eecient implementation of wavefront propagati...
متن کاملCoordinating Team Movements in Dangerous Territory
Suppose a two-member team is required to navigate through dangerous territory (a plane with polygonal obstacles) along two preselected polygonal paths. The team could consist of police officers, soldiers, or even robots on the surface of Mars. Team members are allowed to coordinate their movements, and it is imperative to keep the team close together during the mission so that if an emergency o...
متن کاملCoresets of obstacles in approximating Euclidean shortest path amid convex obstacles
Given a set P of non-intersecting polygonal obstacles in R defined with n vertices, we compute a sketch Ω of P whose size is independent of n. We utilize Ω to devise an algorithm to compute a (1 + )-approximate Euclidean shortest path between two points given with the description of P. When P comprises of convex polygonal obstacles, we devise a (2 + )approximation algorithm to efficiently answe...
متن کاملEfficient Computation of Euclidean Shortest Paths in the Plane
We propose a new algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Our algorithm runs in worst-case time O(nlog2n) and requires O(n1ogn) space, where n is the total number of vertices in the obstacle polygons. Our algorithm actually computes a planar map that encodes shortest paths from a fixed...
متن کامل